Replacing Two Controlled-U’s with Two CNOTs
نویسنده
چکیده
We give a simple, closed-form formula, what we call the Deflation Identity, for converting any 2-qubit circuit with exactly two controlled-U’s (and some 1-qubit rotations) into an equivalent circuit with just two CNOTs (and some 1-qubit rotations). We also give two interesting applications of the Deflation Identity; one to “opening and closing a breach” in a quantum circuit, the other to the CS decomposition of a 2-qubit operator.
منابع مشابه
Simplifying Quantum Circuits via Circuit Invariants and Dressed CNOTs
Quantum Compiling Algorithms decompose (exactly, without approximations) an arbitrary 2B unitary matrix acting on NB qubits, into a sequence of elementary operations (SEO). There are many possible ways of decomposing a unitary matrix into a SEO, and some of these decompositions have shorter length (are more efficient) than others. Finding an optimum (shortest) decomposition is a very hard task,...
متن کامل2 v 2 2 1 N ov 2 00 2 An Arbitrary Two - qubit Computation In 23 Elementary Gates ∗
Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1] as possible. Our lower bound for worst-case optimal two-qubit ci...
متن کاملnt - p h / 02 11 00 2 v 3 3 M ar 2 00 3 An Arbitrary Two - qubit Computation In 23 Elementary Gates ∗
Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1, 15] as possible. Our lower bound for worst-case optimal two-qubi...
متن کاملnt - p h / 02 11 00 2 v 1 3 1 O ct 2 00 2 An Arbitrary Two - qubit Computation In 23 Elementary Gates ∗
Quantum circuits currently constitute a dominant model for quantum computation [13]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1] as possible. Our lower bound for worst-case optimal two-qubit ci...
متن کاملFast quantum modular exponentiation
concurrent architecture, NTC, neighbor-only, two-qubit gate, concurrent architecture; and Perf, performance relative to VBE algorithm for that architecture, based on CCNOTs for AC and CNOTs for NTC.
متن کامل